#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>

using namespace std;

class Solution {
public:
    int HeMax(vector<int>& v, int x)
    {
        int sum = 0;
        for (int i = 0; i < v.size(); i++)
        {
            sum += v[i];
        }
        if (sum <= x) return true;
        else return false;
    }
};
